Higher Rank Numerical Ranges and Low Rank Perturbations of Quantum Channels

نویسنده

  • CHI-KWONG LI
چکیده

For a positive integer k, the rank-k numerical range Λk(A) of an operator A acting on a Hilbert space H of dimension at least k is the set of scalars λ such that PAP = λP for some rank k orthogonal projection P . In this paper, a close connection between low rank perturbation of an operator A and Λk(A) is established. In particular, for 1 ≤ r < k it is shown that Λk(A) ⊆ Λk−r(A + F ) for any operator F with rank (F ) ≤ r. In quantum computing, this result implies that a quantum channel with a k-dimensional error correcting code under a perturbation of rank ≤ r will still have a (k− r)dimensional error correcting code. Moreover, it is shown that if A is normal or if the dimension of A is finite, then Λk(A) can be obtained as the intersection of Λk−r(A + F ) for a collection of rank r operators F . Examples are given to show that the result fails if A is a general operator. The closure and the interior of the convex set Λk(A) are completely determined. Analogous results are obtained for Λ∞(A) defined as the set of scalars λ such that PAP = λP for an infinite rank orthogonal projection P . It is shown that Λ∞(A) is the intersection of all Λk(A) for k = 1, 2, . . . . If A − μI is not compact for any μ ∈ C, then the closure and the interior of Λ∞(A) coincide with those of the essential numerical range of A. The situation for the special case when A−μI is compact for some μ ∈ C is also studied.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GENERALIZED JOINT HIGHER-RANK NUMERICAL RANGE

The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. In this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, Generaliz...

متن کامل

Higher rank numerical ranges of rectangular matrix polynomials

In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...

متن کامل

Multiaccess quantum communication and product higher rank numerical range

In the present paper we initiate the study of the product higher rank numerical range. The latter, being a variant of the higher rank numerical range [M.–D. Choi et al., Rep. Math. Phys. 58, 77 (2006); Lin. Alg. Appl. 418, 828 (2006)], is a natural tool for studying a construction of quantum error correction codes for multiple access channels. We review properties of this set and relate it to o...

متن کامل

Higher-rank Numerical Ranges and Compression Problems

We consider higher-rank versions of the standard numerical range for matrices. A central motivation for this investigation comes from quantum error correction. We develop the basic structure theory for the higher-rank numerical ranges, and give a complete description in the Hermitian case. We also consider associated projection compression problems.

متن کامل

Quantum error correction and generalized numerical ranges

For a noisy quantum channel, a quantum error correcting code exists if and only if the joint higher rank numerical ranges associated with the error operators of the channel is non-empty. In this paper, geometric properties of the joint higher rank numerical ranges are obtained and their implications to quantum computing are discussed. It is shown that if the dimension of the underlying Hilbert ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008